課程資訊
課程名稱
 離散數學
Discrete Mathematics 
開課學期
 109-1 
授課對象
 電機資訊學院  電機工程學系  
授課教師
 雷欽隆 
課號
 EE2008 
課程識別碼
 901 21100 
班次
  
學分
 2.0 
全/半年
 半年 
必/選修
 選修 
上課時間
 星期一3,4(10:20~12:10) 
上課地點
 博理112 
備註
 總人數上限：60人 
Ceiba 課程網頁
 http://ceiba.ntu.edu.tw/1091EE2008_dm 
課程簡介影片
 
核心能力關聯
 核心能力與課程規劃關聯圖
課程大綱
為確保您我的權利,請尊重智慧財產權及不得非法影印
課程概述

1. Mathematical Reasoning
Logic, Proof methods, Inductive Proofs

2. Combinatorial Analysis
Summations, Countability, Probability, Combinatorics, Recurrences, Boolean Algebra

3. Discrete Structures
 Sets, Functions, Sequences, Permutations, Relations, Graphs, Trees, Finite-state Machines

4. Algorithms
 Orders of Growth, Complexity. Specification, Program verification

5. Application and modeling
Model of Computation
 

課程目標
 1. To teach mathematical reasoning and problem solving rather than ad-hoc approaches so that students can think logically and mathematically

2. Guide students to learn how to attack problems

3. To help students develop the skills needed for their further studies. 
課程要求
 Prerequisite:
None

Grading:
1. Homework Assignments 30 %
2. Midterm 30 %
3. Final exam 40 %
 
預期每週課後學習時數
  
Office Hours
 每週一 13:30~15:00 
指定閱讀
  
參考書目
 Textbook： Discrete Mathematics and Its Applications 8th Edition
Kenneth H. Rosen
McGraw-Hill, 2019 
評量方式
(僅供參考)
    
課程進度
週次
日期
單元主題
Week 1
 09/14  OverviewPropositional Logic 
Week 2
 9/21  Predicate Logic 
Week 3
 9/28  Logic and Proofs 
Week 4
 10/05  Logic and Proofs 
Week 5
 10/12  Basic Structures
Homework #1 due 
Week 6
 10/19  Basic Structures 
Week 7
 10/26  Algorithms 
Week 8
 11/02  Algorithms
Homework #2 due
Lecture Notes 3 has been updated
 
Week 9
 11/09  Midterm Exam. 
Week 10
 11/16  Algorithm -- Complexity 
Week 11
 11/23  Number Theory 
Week 12
 11/30  Number Theory  
Week 13
 12/07  Cryptography
Induction / Recursion 
Week 14
 12/14  Counting
Homework %3 due 
Week 15
 12/21  Advanced Counting 
Week 16
 12/28  Relations 
Week 17
 2020/01/04  Graphs / TreesHomework 
Week 18
 01/11  Final Exam.